Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition

摘要

This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.